On parsimonious edge-colouring of graphs with maximum degree three
نویسندگان
چکیده
In a graph G of maximum degree ∆ let γ denote the largest fraction of edges that can be ∆ edge-coloured. Albertson and Haas showed that γ ≥ 13 15 when G is cubic [1]. We show here that this result can be extended to graphs with maximum degree 3 with the exception of a graph on 5 vertices. Moreover, there are exactly two graphs with maximum degree 3 (one being obviously the Petersen graph) for which γ = 13 15 . This extends a result given in [14]. These results are obtained by giving structural properties of the so called δ−minimum edge colourings for graphs with maximum degree 3.
منابع مشابه
Tools for parsimonious edge-colouring of graphs with maximum degree three
The notion of a δ-minimum edge-colouring was introduced by J-L. Fouquet (in his french PhD Thesis [2]). Here we present some structural properties of δ-minimum edge-colourings, partially taken from the above thesis. The paper serves as an auxiliary tool for another paper submitted by the authors to Graphs and Combinatorics.
متن کاملA new bound for parsimonious edge-colouring of graphs with maximum degree three
In a graph G of maximum degree 3, let γ(G) denote the largest fraction of edges that can be 3 edge-coloured. Rizzi [9] showed that γ(G) ≥ 1 − 2 3godd(G) where godd(G) is the odd girth of G, when G is triangle-free. In [3] we extended that result to graph with maximum degree 3. We show here that γ(G) ≥ 1− 2 3godd(G)+2 , which leads to γ(G) ≥ 15 17 when considering graphs with odd girth at least ...
متن کاملOn the Edge-colouring of Split Graphs on the Edge-colouring of Split Graphs
We consider the following question: can split graphs with odd maximum degree be edge-coloured with maximum degree colours? We show that any odd maximum degree split graph can be transformed into a special split graph. For this special split graph, we were able to solve the question, in case the graph has a quasi-universal vertex.
متن کاملA greedy method for edge-colouring odd maximum degree doubly chordal graphs
We describe a greedy vertex colouring method which can be used to colour optimally the edge set of certain chordal graphs. This new heuristic yields an exact edge-colouring algorithm for odd maximumdegree doubly chordal graphs. This method shows that any such graph G can be edge-coloured with maximum degree (G) colours, i.e., all these graphs are Class 1. In addition, this method gives a simple...
متن کاملOn Edge-colouring Indiierence Graphs on Edge-colouring Indiierence Graphs
Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is called overfull if jE(G)j > (G)bjV (G)j=2c. A suu-cient condition for 0 (G) = (G)+1 is that G contains an overfull subgraph H with (H) = (G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for indi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008